Перевод: с английского на русский

с русского на английский

partial enumeration

См. также в других словарях:

  • Enumeration — In mathematics and theoretical computer science, the broadest and most abstract definition of an enumeration of a set is an exact listing of all of its elements (perhaps with repetition). The restrictions imposed on the type of list used depend… …   Wikipedia

  • Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is …   Wikipedia

  • Separable partial differential equation — A separable partial differential equation (PDE) is one that can be broken into a set of separate equations of lower dimensionality (fewer independent variables) by a method of separation of variables. This generally relies upon the problem having …   Wikipedia

  • blood count — noun 1. the number of red and white corpuscles in a blood sample • Hypernyms: ↑count 2. the act of estimating the number of red and white corpuscles in a blood sample • Hypernyms: ↑count, ↑counting, ↑numeration, ↑enumeration, ↑recko …   Useful english dictionary

  • Victor de Buck — (April 21, 1817, Oudenaarde, Flanders – June 28, 1876) was a Jesuit theologian and Bollandist hagiographer. His family was one of the most distinguished in the city of Oudenaarde. After a distinguished course in the humanities, begun at the… …   Wikipedia

  • Comparison of C Sharp and Java — The correct title of this article is Comparison of C# and Java. The substitution or omission of the # sign is because of technical restrictions. Programming language comparisons General comparison Basic syntax Basic instructions …   Wikipedia

  • Mathematics of Sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N}), so that each …   Wikipedia

  • Kleene's recursion theorem — In computability theory, Kleene s recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938.This article uses the… …   Wikipedia

  • Comparison of Java and C Sharp — This is a comparison of the C# programming language with the Java programming language. As the two are both garbage collected runtime compiled languages with syntax derived from C and C++, there are many similarities between Java and C#. However …   Wikipedia

  • Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …   Wikipedia

  • Random permutation statistics — The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example,… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»